Collaborative Decoding of Interleaved Reed-Solomon Codes using Gaussian Elimination
نویسندگان
چکیده
We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.
منابع مشابه
Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs
Interleaved Reed–Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed–Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. However, by collaborative algebraic decoding approaches, such interleaved schemes allow the correction ...
متن کاملUnambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance
The Schmidt–Sidorenko–Bossert scheme extends a low-rate Reed–Solomon code to an Interleaved Reed–Solomon code and achieves the decoding radius of Sudan’s original list decoding algorithm while the decoding result remains unambiguous. We adapt this result to the case of Generalized Reed– Solomon codes and calculate the parameters of the corresponding Interleaved Generalized Reed–Solomon code. Fu...
متن کاملSimultaneous Partial Inverses and Decoding Interleaved Reed-Solomon Codes
This paper introduces the simultaneous partialinverse problem for polynomials and develops its application to decoding interleaved Reed-Solomon codes and subfield-evaluation codes beyond half the minimum distance. The simultaneous partial-inverse problem has a unique solution (up to a scale factor), which can be computed by an efficient new algorithm, for which we also offer some variations. De...
متن کاملEfficient decoding of Reed-Solomon codes beyond half the minimum distance
A list decoding algorithm is presented for [ ] Reed–Solomon (RS) codes over GF ( ), which is capable of correcting more than ( ) 2 errors. Based on a previous work of Sudan, an extended key equation (EKE) is derived for RS codes, which reduces to the classical key equation when the number of errors is limited to ( ) 2 . Generalizing Massey’s algorithm that finds the shortest recurrence that gen...
متن کاملE cient Decoding of Reed Solomon Codes Beyond Half the Minimum Distance
A list decoding algorithm is presented for n k Reed Solomon RS codes over GF q which is capable of correcting more than b n k c errors Based on a previous work of Sudan an extended key equation EKE is derived for RS codes which reduces to the classi cal key equation when the number of errors is limited to b n k c Generalizing Massey s algorithm that nds the shortest recurrence that generates a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1009.3396 شماره
صفحات -
تاریخ انتشار 2010